Advanced Coarsening Schemes for Graph Partitioning
نویسندگان
چکیده
منابع مشابه
Comparison of Coarsening Schemes for Multilevel Graph Partitioning
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a practical tool to solve this problem. A multilevel algorithm may be viewed as a process of graph topology learning at different scales in order to generate a better approximation for any approximation method incorporated...
متن کاملMultilevel Graph Partitioning Schemes
In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph. We investigate the effectiveness of many different choices for all three phases: coarsening, partition of the coarsest graph, and refinement. In p...
متن کاملImproving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure
We present an improved coarsening process for multilevel hypergraph partitioning that incorporates global information about the community structure. Community detection is performed via modularity maximization on a bipartite graph representation. The approach is made suitable for different classes of hypergraphs by defining weights for the graph edges that express structural properties of the h...
متن کاملData Flow Graph Partitioning Schemes
The ordering of operations in a data flow program is not specified by the programmer, but is implied by the data dependencies. This advantage can be exploited further on multiprocessor architectures by grouping the nodes in the corresponding data flow graph and allocating these groups efficiently to processors. This paper presents and compares some of the numerous heuristic approaches that were...
متن کاملAggregative Coarsening for Multilevel Hypergraph Partitioning
Algorithms for many hypergraph problems, including partitioning, utilize multilevel frameworks to achieve a good trade-off between the performance and the quality of results. In this paper we introduce two novel aggregative coarsening schemes and incorporate them within state-of-the-art hypergraph partitioner Zoltan. Our coarsening schemes are inspired by the algebraic multigrid and stable matc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Journal of Experimental Algorithmics
سال: 2015
ISSN: 1084-6654,1084-6654
DOI: 10.1145/2670338